A NEW PERSPECTIVE OF METAHEURISTIC ALGORITHMS
نویسندگان
چکیده
Optimization is the art of modeling in order to produce optimal outcome under given conditions. The objective optimization maximize or decrease consequences that best satisfy technological and management procedures. In view findings, this paper provides a brief survey methods for examining problem space, illustrates mechanics metaheuristic developmental calculations, defines their connection constructing problems. addition covering encoding calculations constraints, also delves into periods introductory provisional arrangements, iterative determination assessment execution calculations. All meta-heuristic are shown share single calculation with respective phases highlighted.
منابع مشابه
A new multi-objective mathematical model for a Citrus supply chain network design: Metaheuristic algorithms
Nowadays, the citrus supply chain has been motivated by both industrial practitioners and researchers due to several real-world applications. This study considers a four-echelon citrus supply chain, consisting of gardeners, distribution centers, citrus storage, and fruit market. A Mixed Integer Non-Linear Programming (MINLP) model is formulated, which seeks to minimize the total cost and maximi...
متن کاملEM Algorithms: A New Perspective∗
The EM algorithm is not a single algorithm, but a template for the construction of iterative algorithms. While it is always presented in stochastic language, relying on conditional expectations to obtain a method for estimating parameters in statistics, the essence of the EM algorithm is not stochastic. The conventional formulation of the EM algorithm given in many texts and papers on the subje...
متن کاملExplaining Algorithms: A New Perspective
This paper presents a novel approach for explaining algorithms that aims to overcome various pedagogical limitations of the current visualization systems. The main idea is that at any given time, a learner is able to focus on a single problem. This problem can be explained, studied, understood and tested, before the learner moves on to study another problem. Towards this end, a visualization sy...
متن کاملMETAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...
متن کاملA New Perspective of Proximal Gradient Algorithms
We provide a new perspective to understand proximal gradient algorithms. We show that both proximal gradient algorithm (PGA) and Bregman proximal gradient algorithm (BPGA) can be viewed as generalized proximal point algorithm (GPPA), based on which more accurate convergence rates of PGA and BPGA are obtained directly. Furthermore, based on GPPA framework, we incorporate the back-tracking line s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Academic journal of Nawroz University
سال: 2023
ISSN: ['2520-789X']
DOI: https://doi.org/10.25007/ajnu.v12n1a1660